ZNCC-based template matching using bounded partial correlation

نویسندگان

  • Luigi di Stefano
  • Stefano Mattoccia
  • Federico Tombari
چکیده

This paper describes a class of algorithms enabling efficient and exhaustive matching of a template into an image based on the Zero mean Normalized Cross-Correlation function (ZNCC). The approach consists in checking at each image position two sufficient conditions obtained at a reduced computational cost. This allows to skip rapidly most of the expensive calculations required to evaluate the ZNCC at those image points that cannot improve the best correlation score found so far. The algorithms shown in this paper generalize and extend the concept of Bounded Partial Correlation (BPC), previously devised for a template matching process based on the Normalized Cross-Correlation function (NCC). 2005 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Algorithm for Efficient and Exhaustive Template Matching

This paper proposes an algorithm for efficient and exhaustive template matching based on the Zero mean Normalized Cross Correlation (ZNCC) function. The algorithm consists in checking at each position a sufficient condition capable of rapidly skipping most of the expensive calculations involved in the evaluation of ZNCC scores at those points that cannot improve the best score found so far. The...

متن کامل

Modifications in Normalized Cross Correlation Expression for Template Matching Applications

This paper analyzes the performance of sum of squared differences (SSD), sum of absolute differences (SAD), normalized cross correlation (NCC), zero mean normalized cross correlation (ZNCC) and several other proposed modified expressions of NCC. Experimental results on real images demonstrate that some of the proposed modified expressions of NCC are more efficient than conventional NCC for temp...

متن کامل

Efficient template matching for multi-channel images

Template matching is a computationally intensive problem aimed at locating a template within a image. When dealing with images having more than one channel, the computational burden becomes even more dramatic. For this reason, in this paper we investigate on a methodology to speed-up template matching on multi-channel images without deteriorating the outcome of the search. In particular, we pro...

متن کامل

Evaluation of Similarity Measures for Template Matching

Image matching is a critical process in various photogrammetry, computer vision and remote sensing applications such as image registration, 3D model reconstruction, change detection, image fusion, pattern recognition, autonomous navigation, and digital elevation model (DEM) generation and orientation. The primary goal of the image matching process is to establish the correspondence between two ...

متن کامل

Fast Stereo Matching Using Rectification and Correlation Techniques

F This paper presents a new method for matching points of interest in stereoscopic. A self-calibration is realized by using points of interest on both images in order to estimate the fundamental matrix from which we can compute both projected matrices related to each camera. We propose a robust and fast rectification technique for matching points of interest in order to simplify the research on...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Pattern Recognition Letters

دوره 26  شماره 

صفحات  -

تاریخ انتشار 2005